On-line service scheduling

On-line service scheduling

This paper is concerned with a scheduling problem that occurs in service systems, where customers are classified as ‘ordinary’ and ‘special’. Ordinary customers can be served on any service facility, while special customers can be served only on the flexible service facilities. Customers arrive dynamically over time and their needs become known upon arrival. We assume any service, once started,...

On-Line Real-Time Service-Oriented Task Scheduling Using TUF

We present our approach to real-time service-oriented scheduling problems with the objective of maximizing the total system utility. Different from the traditional utility accrual scheduling problems that each task is associated with only a single time utility function (TUF), we associate two different TUFs—a profit TUF and a penalty TUF—with each task, tomodel the real-time services that not o...

On-line Scheduling via Sampling

We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks served before their deadline is reached. This problem is faced for example by schedulers in packet communication networks when packets have deadlines and rewards associated with them. We make the simplifying assumptions tha...

On-line Multi-threaded Scheduling

Bounds on Gang Service Scheduling

We deene the bounds of two gang service algorithms, namely time balanced and instruction balanced, using interactivity and throughput based metrics. The work-load is composed of V-RAM jobs, and the architectural model chosen is LogP. We also analyze the eeect of workload and space sharing strategies on the bounds found. The following results are demonstrated: when inter-activity is considered, ...